Freeness of partial words
نویسندگان
چکیده
منابع مشابه
Freeness of partial words
The paper approaches the classical combinatorial problem of freeness of words, in the more general case of partial words. First, we propose an algorithm that tests efficiently whether a partial word is kfree or not. Then, we show that there exist arbitrarily many cube-free infinite partial words containing an infinite number of holes, over binary alphabets; thus, there exist arbitrarily many k-...
متن کاملOverlap-freeness in infinite partial words
10 We prove that there exist infinitely many infinite overlap-free binary partial words. 11 Moreover, we show that these words can contain only one hole and the hole must 12 occur either in the first or in the second position. We define that a partial word is 13 k-overlap-free if it does not contain a factor of the form xyxyx where the length 14 of x is at least k. We prove that there exist inf...
متن کاملA generalization of Thue freeness for partial words
This paper approaches the combinatorial problem of Thue freeness for partial words. Partial words are sequences over a finite alphabet that may contain a number of “holes.” First, we give an infinite word over a three-letter alphabet which avoids squares of length greater than two even after we replace an infinite number of positions with holes. Then, we give an infinite word over an eight-lett...
متن کاملTesting Generalised Freeness of Words
Pseudo-repetitions are a natural generalisation of the classical notion of repetitions in sequences: they are the repeated concatenation of a word and its encoding under a certain morphism or antimorphism (anti-/morphism, for short). We approach the problem of deciding efficiently, for a word w and a literal anti-/morphism f , whether w contains an instance of a given pattern involving a variab...
متن کاملPartial Freeness of Random Matrices
We investigate the implications of free probability for random matrices. From rules for calculating all possible joint moments of two free random matrices, we develop a notion of partial freeness which is quantified by the breakdown of these rules. We provide a combinatorial interpretation for partial freeness as the presence of closed paths in Hilbert space defined by particular joint moments....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2007
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2007.09.028